This paper is based on a resource constrained active network project;the constraint of the local resource and the time constraint of the cooperation resource are considered simultaneously.And the respective benefit of the manager and cooperation partners is also considered simultaneously.And a cooperation planning model based on bilevel multi-objective programming is de- signed,according to the due time and total cost.And an extended CNP based on the permitted range for resource and time requests is presented.A larger task set in scheduling cycle is on the permitting for the request of cooperation resource and time while the task manager itself may be permitted biding for tasks.As a result,the optimization space for the cooperation planning is enlarged.So not every bidding task is successfully bid by invitee,and the task manager itself takes on some bidding tasks.Finally,the genetic algorithm is given and the validity and feasibility of the model is proved by a case.

A Cooperation-planning Model Based on Bilevel Programming DecisionZHANG Jianfeng ZHOU Lei BAO Zhenqiang BIAN Wenyu LI Xiangqing Information Engineering College,Yangzhou University,Yangzhou 225009,China,This paper is based on a resource constrained active network project;the constraint of the local resource and the time constraint of the cooperation resource are considered simultaneously.And the respective benefit of the manager and cooperation partners is also considered simultaneously.And a cooperation planning model based on bilevel multi-objective programming is de- signed,according to the due time and total cost.And an extended CNP based on the permitted range for resource and time requests is presented.A larger task set in scheduling cycle is on the permitting for the request of cooperation resource and time while the task manager itself may be permitted biding for tasks.As a result,the optimization space for the cooperation planning is enlarged.So not every bidding task is successfully bid by invitee,and the task manager itself takes on some bidding tasks.Finally,the genetic algorithm is given and the validity and feasibility of the model is proved by a case.bilevel programming decision;;cooperation planning;;genetic algorithm;;range for resource and time sequest